Regularity, depth and arithmetic rank of bipartite edge ideals

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Regularity, Depth and Arithmetic Rank of Bipartite Edge Ideals

We study minimal free resolutions of edge ideals of bipartite graphs. We associate a directed graph to a bipartite graph whose edge ideal is unmixed, and give expressions for the regularity and the depth of the edge ideal in terms of invariants of the directed graph. For some classes of unmixed edge ideals, we show that the arithmetic rank of the ideal equals projective dimension of its quotient.

متن کامل

Regularity of second power of edge ideals

Let G be a graph with edge ideal I(G). Benerjee and Nevo proved that for every graph G, the inequality reg(I(G)2)≤reg(I(G))+2 holds. We provide an alternative proof for this result.

متن کامل

Regularity Bounds for Binomial Edge Ideals

We show that the Castelnuovo–Mumford regularity of the binomial edge ideal of a graph is bounded below by the length of its longest induced path and bounded above by the number of its vertices.

متن کامل

An upper bound for the regularity of powers of edge ideals

‎A recent result due to Ha and Van Tuyl proved that the Castelnuovo-Mumford regularity of the quotient ring $R/I(G)$ is at most matching number of $G$‎, ‎denoted by match$(G)$‎. ‎In this paper‎, ‎we provide a generalization of this result for powers of edge ideals‎. ‎More precisely‎, ‎we show that for every graph $G$ and every $sgeq 1$‎, ‎$${rm reg}( R‎/ ‎I(G)^{s})leq (2s-1) |E(G)|^{s-1} {rm ma...

متن کامل

Efficient Arithmetic Regularity and Removal Lemmas for Induced Bipartite Patterns

Let G be an abelian group of bounded exponent and A ⊂ G. We show that if the collection of translates of A has VC dimension at most d, then for every > 0 there is a subgroup H of G of index at most −d−o(1) such that one can add or delete at most |G| elements to A to make it a union of H-cosets. We also establish a removal lemma with polynomial bounds, with applications to property testing, for ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Algebraic Combinatorics

سال: 2009

ISSN: 0925-9899,1572-9192

DOI: 10.1007/s10801-009-0171-6